0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : purification_ext
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --ho-purify ext \
0.00/0.00	  --ho-ext-axiom \
0.00/0.00	  --restrict-hidden-sup-at-vars \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.20	% Computer   : n082.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 16:47:09 CST 2018
0.00/0.21	% done 4 iterations in 0.004s
0.00/0.21	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.21	% SZS output start Refutation
0.00/0.21	tff(cE1LEIBEQ1_pme, conjecture,
0.00/0.21	  ((![Xq:(a > $o)]: (Xq(u) => Xq(v))) =>
0.00/0.21	   (![Q:((a * a) > $o)]: ((![Z:a]: Q(Z,Z)) => Q(u,v))))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture,
0.00/0.21	  (~
0.00/0.21	    ((![Xq:(a > $o)]: (Xq(u) => Xq(v))) =>
0.00/0.21	     (![Q:((a * a) > $o)]: ((![Z:a]: Q(Z,Z)) => Q(u,v)))))).
0.00/0.21	tff('0', plain, ![X1 : a]: sk_Q(X1, X1),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('1', plain, ![X0 : a > $o]: (X0(v) | ~ X0(u)),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('2', plain, ![X0 : a > $o, X1 : a > $o]: (X1 != X0 | X0(v) | ~ X1(u)),
0.00/0.21	    inference('ho.purify_applied_variable', [status(thm)], ['1'])).
0.00/0.21	tff('3', plain, ![X0 : a > $o]: (~ $true | X0(v) | sk_Q(u) != X0),
0.00/0.21	    inference('sup-', [status(thm)], ['0', '2'])).
0.00/0.21	tff('4', plain, ![X0 : a > $o]: (sk_Q(u) != X0 | X0(v)),
0.00/0.21	    inference('simplify', [status(thm)], ['3'])).
0.00/0.21	tff('5', plain,
0.00/0.21	    ![X0 : a > $o, X1 : a > $o]: (X1 != X0 | sk_Q(u) != X0 | X1(v)),
0.00/0.21	    inference('ho.purify_applied_variable', [status(thm)], ['4'])).
0.00/0.21	tff('6', plain, ~ sk_Q(u, v), inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('7', plain, ![X0 : a > $o]: (~ $true | sk_Q(u) != X0 | sk_Q(u) != X0),
0.00/0.21	    inference('sup-', [status(thm)], ['5', '6'])).
0.00/0.21	tff('8', plain, ![X0 : a > $o]: sk_Q(u) != X0,
0.00/0.21	    inference('simplify', [status(thm)], ['7'])).
0.00/0.21	tff('9', plain, $false, inference('eq_res', [status(thm)], ['8'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
